Reverse top-k search using random walk with restart
نویسندگان
چکیده
منابع مشابه
Reverse Top-k Search using Random Walk with Restart
With the increasing popularity of social networks, large volumes of graph data are becoming available. Large graphs are also derived by structure extraction from relational, text, or scientific data (e.g., relational tuple networks, citation graphs, ontology networks, protein-protein interaction graphs). Node-to-node proximity is the key building block for many graph-based applications that sea...
متن کاملFast Inbound Top-K Query for Random Walk with Restart
Random walk with restart (RWR) is widely recognized as one of the most important node proximity measures for graphs, as it captures the holistic graph structure and is robust to noise in the graph. In this paper, we study a novel query based on the RWR measure, called the inbound top-k (Ink) query. Given a query node q and a number k, the Ink query aims at retrieving k nodes in the graph that h...
متن کاملFast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been em-ployed for centuries to model real-world systems and phe-nomena. Random walk with restart (RWR) provides a goodproximity score between two nodes in a graph, and it hasbeen successfully used in many applications such as auto-matic image captioning, recommender systems, and link pre-diction. The goal of this work is t...
متن کاملProbabilistic Correspondence Matching using Random Walk with Restart
This paper presents a probabilistic method for correspondence matching with a framework of the random walk with restart (RWR). The matching cost is reformulated as a corresponding probability, which enables the RWR to be utilized for matching the correspondences. There are mainly two advantages in our method. First, the proposed method guarantees the non-trivial steady-state solution of a given...
متن کاملRandom Walk with Wait and Restart on Document Co-citation Network for Similar Document Search
One of the latest algorithms for computing similarities between nodes in a graph is Random Walk with Restart (RWR). However, on a document co-citation network for similar document search, computing transition probabilities remains difficult. To solve the problem, this paper proposes a Random Walk with Wait and Restart (RWWR) algorithm, which contains a new technique for adjusting the transition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2014
ISSN: 2150-8097
DOI: 10.14778/2732269.2732276